Search strings

Search for Cosmic Strings in CMB Anisotropies

We have searched the 1st-year WMAP W-Band CMB anisotropy map for evidence of cosmic strings. We have set a limit of δ = 8πGμ/c < 8.2× 10 at 95% CL for statistical search for a significant number of strings in the map. We also have set a limit using the uniform distribution of strings model in the WMAP data with δ = 8πGμ/c < 7.34 × 10 at 95% CL. And the pattern search technique we developed here...

Search Data Structures for Skewed Strings

We consider skewed distributions of strings, in which any two such strings share a common prefix much longer than that expected in uniformly distributed (random) strings. For instance, this is the case of URL addresses, IP addresses, or XML path strings, all representing paths in some hierarchical order. As strings sharing a portion of the path have a quite long common prefix, we need to avoid ...

A Search for New (2, 2) Strings

There are at present two known string theories in (2, 2) dimensions. One of them is the well known N = 2 string, and the other one is a more recently constructed N = 1 spacetime supersymmetric string. They are both based on certain twistings and/or truncations of the small N = 4 superconformal algebra, realised in terms of (2, 2) superspace variables. In this paper, we investigate more general ...

Closest Strings, Primer Design, and Motif Search

Spurious Motifs.Our algorithm finds all positions in the strings that meet the specified requirements and will report no positions that do not; this is its advantage in contrast to algorithms in [5] and [3]. However, it clearly cannot exclude to find spurious motifs, e.g., random motifs in artificially generated data that have not been implanted. Note that not all combinations of L and d values...

How does familiarity affect visual search for letter strings?